Decidable Fragments of Logics Based on Team Semantics
نویسندگان
چکیده
We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of the Bernays-Schönfinkel-Ramsey prefix classes of dependence logic.
منابع مشابه
On Correspondences between Probabilistic First-Order and Description Logics
This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We argue that this is an appropriate way of investigating its properties and developing extensions. We show how the previously made arguments about different types of first-order probabilistic semantics apply to P-SHIQ. This app...
متن کاملReasoning on Procedural Programs using Description Logics with Concrete Domains
Existing approaches to assigning semantics to procedural programming languages do not easily allow automatic reasoning over programs. We assign a model theoretic semantics to programs of a simple procedural language, by encoding them into description logics with concrete domains. This allows us to flexibly express several reasoning problems over procedural programs, and to solve them efficientl...
متن کاملResolution based decision procedures for subclasses of first-order logic
This thesis studies decidable fragments of first-order logic which are relevant to the field of nonclassical logic and knowledge representation. We show that refinements of resolution based on suitable liftable orderings provide decision procedures for the subclasses E+, K, and DK of firstorder logic. By the use of semantics-based translation methods we can embed the description logic ALB and e...
متن کاملOn the relationship between decidable fragments, non-classical logics, and description logics
The guarded fragment [1] and its extensions and subfragments have often been considered as a framework for investigating the properties of description logics [8, 18]. But there are other decidable fragments which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey of some of these fragments and motivate why they are interesting...
متن کاملA Survey of Decidable First-Order Fragments and Description Logics
The guarded fragment and its extensions and subfragments are often considered as a framework for investigating the properties of description logics. There are also other, some less well-known, decidable fragments of first-order logic which all have in common that they generalise the standard translation of ALC to first-order logic. We provide a short survey of some of these fragments and motiva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.5037 شماره
صفحات -
تاریخ انتشار 2014